On the efficiency of solving Boolean polynomial systems with the characteristic set method

An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This based on the idea of converting all polynomials into monic ones by zero decomposition, and using additions to obtain pseudo-remainders. Three important techniques are applied in algorithm. The first one eliminating variables new generated linear polynomials. second optimizing strategy choosing decomposition. third compute add-remainders eliminate leading variable By analyzing depth decomposition tree, we present some complexity bounds this algorithm, which lower than previous algorithms. Extensive experimental results show that more efficient algorithms systems.